Trees within trees II: Nested fragmentations
نویسندگان
چکیده
منابع مشابه
Approximation of trees by self-nested trees
The class of self-nested trees presents remarkable compression properties because of the systematic repetition of subtrees in their structure. In this paper, we provide a better combinatorial characterization of this specific family of trees. We show that self-nested trees may be considered as an approximation class of unordered trees. We compare our approximation algorithms with a competitive ...
متن کاملNested Junction Trees
The efficiency of inference in both the Hugin and, most notably, the Shafer-Shenoy archi tectures can be improved by exploiting the independence relations induced by the incom ing messages of a clique. That is, the mes sage to be sent from a clique can be com puted via a factorization of the clique poten tial in the form of a junction tree. In this pa per we show that by exploiting such n...
متن کاملLanguages of Nested Trees
We study languages of nested trees—structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown programs, so that the problem of branching-time software model checking may be phrased as a membership question for such languages. We define finite-state automata accepting such languages—these automata can pass states along...
متن کاملTrees within trees: phylogeny and historical associations.
The association between two or more lineages over evolutionary time is a recurrent theme spanning several different fields within biology, from molecular evolution to coevolution and biogeography. In each `historical association', one lineage is associated with another, and can be thought of as tracking the other over evolutionary time with a greater or lesser degree of fidelity. Examples inclu...
متن کاملThe stable trees are nested
We show that we can construct simultaneously all the stable trees as a nested family. More precisely, if 1 < α < α′ ≤ 2 we prove that hidden inside any α-stable tree we can find a version of an α′-stable tree rescaled by an independent Mittag-Leffler type distribution. This tree can be explicitly constructed by a pruning procedure of the underlying stable tree or by a modification of the fragme...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de l'Institut Henri Poincaré, Probabilités et Statistiques
سال: 2020
ISSN: 0246-0203
DOI: 10.1214/19-aihp999